Threshold values of Random K-SAT from the cavity method
نویسندگان
چکیده
Using the cavity equations of Mézard, Parisi, and Zecchina [Science 297 (2002), 812; Mézard and Zecchina, Phys Rev E 66 (2002), 056126] we derive the various threshold values for the number of clauses per variable of the random K-satisfiability problem, generalizing the previous results to K ≥ 4. We also give an analytic solution of the equations, and some closed expressions for these thresholds, in an expansion around large K . The stability of the solution is also computed. For anyK , the satisfiability threshold is found to be in the stable region of the solution, which adds further credit to the conjecture that this computation gives the exact satisfiability threshold. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 28, 000–000, 2006
منابع مشابه
Pairs of SAT Assignment in Random Boolean Formulae
We investigate geometrical properties of the random K-satisfiability problem using the notion of x-satisfiability: a formula is x-satisfiable is there exist two SAT assignments differing in Nx variables. We show the existence of a sharp threshold for this property as a function of the clause density. For large enough K, we prove that there exists a region of clause density, below the satisfiabi...
متن کاملPairs of SAT Assignment in Random Boolean Formulæ
We investigate geometrical properties of the random K-satisfiability problem using the notion of x-satisfiability: a formula is x-satisfiable is there exist two SAT assignments differing in Nx variables. We show the existence of a sharp threshold for this property as a function of the clause density. For large enough K, we prove that there exists a region of clause density, below the satisfiabi...
متن کاملPairs of SAT-assignments in random Boolean formulæ
We investigate geometrical properties of the random K -satisfiability problem using the notion of x-satisfiability: a formula is x-satisfiable is there exist two SAT-assignments differing in Nx variables. We show the existence of a sharp threshold for this property as a function of the clause density. For large enough K , we prove that there exists a region of clause density, below the satisfia...
متن کاملPairs of SAT Assignments and Clustering in Random Boolean Formulæ
We investigate geometrical properties of the random K-satisfiability problem. For large enough K, we prove that there exists a region of clause density, below the satisfiability threshold, where SAT assignments are grouped into well separated clusters. This confirms the validity of the clustering scenario which is at the heart of the recent heuristic analysis of satisfiability using statistical...
متن کاملBounds on Threshold of Regular Random k-SAT
We consider the regular model of formula generation in conjunctive normal form (CNF) introduced by Boufkhad et. al. in [6]. In [6], it was shown that the threshold for regular random 2-SAT is equal to unity. Also, upper and lower bound on the threshold for regular random 3-SAT were derived. Using the first moment method, we derive an upper bound on the threshold for regular random k-SAT for any...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 28 شماره
صفحات -
تاریخ انتشار 2006